Search results for "Geometry and Topology"

showing 10 items of 457 documents

Dual attachment pairs in categorically-algebraic topology

2011

[EN] The paper is a continuation of our study on developing a new approach to (lattice-valued) topological structures, which relies on category theory and universal algebra, and which is called categorically-algebraic (catalg) topology. The new framework is used to build a topological setting, based in a catalg extension of the set-theoretic membership relation "e" called dual attachment, thereby dualizing the notion of attachment introduced by the authors earlier. Following the recent interest of the fuzzy community in topological systems of S. Vickers, we clarify completely relationships between these structures and (dual) attachment, showing that unlike the former, the latter have no inh…

(pre)image operatorWeak topologyTopological algebralcsh:Mathematicslcsh:QA299.6-433Quasi-framelcsh:AnalysisTopological spacelcsh:QA1-939Topological vector spaceHomeomorphismAlgebraDual attachment pair(LM)-fuzzy topologyTrivial topologyCategory of topological spacesVarietyGeometry and TopologyGeneral topology(lattice-valued) categorically-algebraic topologyTopological systemQuasi-coincidence relationSpatialization(localic) algebraMathematics
researchProduct

Two-dimensional Banach spaces with polynomial numerical index zero

2009

We study two-dimensional Banach spaces with polynomial numerical indices equal to zero.

/dk/atira/pure/subjectarea/asjc/2600/2608/dk/atira/pure/subjectarea/asjc/2600/2607Eberlein–Šmulian theoremBanach manifoldFinite-rank operatorPolynomialMatrix polynomialFOS: MathematicsDiscrete Mathematics and Combinatorics/dk/atira/pure/subjectarea/asjc/2600/2602C0-semigroupLp spaceMathematicsMathematics::Functional AnalysisNumerical AnalysisBanach spaceAlgebra and Number TheoryMathematical analysisFunctional Analysis (math.FA)Mathematics - Functional Analysis46B04 (Primary) 46B20 46G25 47A12 (Secondary)Polynomial numerical indexInterpolation space/dk/atira/pure/subjectarea/asjc/2600/2612Geometry and TopologyNumerical rangeMonic polynomialLinear Algebra and its Applications
researchProduct

Common fixed points of g-quasicontractions and related mappings in 0-complete partial metric spaces

2012

Abstract Common fixed point results are obtained in 0-complete partial metric spaces under various contractive conditions, including g-quasicontractions and mappings with a contractive iterate. In this way, several results obtained recently are generalized. Examples are provided when these results can be applied and neither corresponding metric results nor the results with the standard completeness assumption of the underlying partial metric space can. MSC:47H10, 54H25.

0-complete spaceDiscrete mathematicsInjective metric spaceApplied Mathematicspartial metric space010102 general mathematicsquasicontraction.common fixed pointEquivalence of metrics01 natural sciencesIntrinsic metricConvex metric space010101 applied mathematicsMetric spacefixed pointSettore MAT/05 - Analisi MatematicaMetric (mathematics)Geometry and Topology0101 mathematicsMetric differentialFisher information metricMathematicsFixed Point Theory and Applications
researchProduct

Filament sets and decompositions of homogeneous continua

2007

Abstract This paper applies the concepts introduced in the article: Filament sets and homogeneous continua [J.R. Prajs, K. Whittington, Filament sets and homogeneous continua, Topology Appl. 154 (8) (2007) 1581–1591, doi:10.1016/j.topol.2006.12.005 ] to decompositions of homogeneous continua. Several new or strengthened results on aposyndesis are given. Newly defined decompositions are discussed. A proposed classification scheme for homogeneous continua is shown to be mostly invariant under Jones' aposyndetic decomposition.

010102 general mathematicsMathematical analysisClassification scheme01 natural sciences010101 applied mathematicsProtein filamentHomogeneousContinuumFilamentHomogeneousGeometry and Topology0101 mathematicsInvariant (mathematics)MathematicsTopology and its Applications
researchProduct

Surrogate models for the compressive strength mapping of cement mortar materials

2021

Despite the extensive use of mortar materials in constructions over the last decades, there is not yet a robust quantitative method available in the literature, which can reliably predict their strength based on the mix components. This limitation is attributed to the highly nonlinear relation between the mortar’s compressive strength and the mixed components. In this paper, the application of artificial intelligence techniques for predicting the compressive strength of mortars is investigated. Specifically, Levenberg–Marquardt, biogeography-based optimization, and invasive weed optimization algorithms are used for this purpose (based on experimental data available in the literature). The c…

0209 industrial biotechnologyArtificial neural networksbusiness.industryComputer scienceCementCompressive strengthComputational intelligence02 engineering and technologyStructural engineeringSoft computing techniquesTheoretical Computer ScienceMortarSettore ICAR/09 - Tecnica Delle CostruzioniNonlinear system020901 industrial engineering & automationCompressive strength0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingGeometry and TopologyMortarbusinessMetakaolinSoftwareCement mortarSoft Computing
researchProduct

BIAM: a new bio-inspired analysis methodology for digital ecosystems based on a scale-free architecture

2017

Today we live in a world of digital objects and digital technology; industry and humanities as well as technologies are truly in the midst of a digital environment driven by ICT and cyber informatics. A digital ecosystem can be defined as a digital environment populated by interacting and competing digital species. Digital species have autonomous, proactive and adaptive behaviors, regulated by peer-to-peer interactions without central control point. An interconnecting architecture with few highly connected nodes (hubs) and many low connected nodes has a scale- free architecture. A new bio-inspired analysis methodology (BIAM) environment, an investigation strategy for information flow, fault…

0209 industrial biotechnologyComputer scienceDistributed computingScale (chemistry)Metabolic networkComputational intelligence02 engineering and technologyTheoretical Computer ScienceSet (abstract data type)Scale-free architectureDigital ecosystemDigital ecosystem020901 industrial engineering & automationInformation and Communications TechnologyInformatics0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingEcosystemDE architectural analysiGeometry and TopologyInformation flow (information theory)ArchitectureScience technology and societySoftware
researchProduct

George-Veeramani Fuzzy Metrics Revised

2018

In this note, we present an alternative approach to the concept of a fuzzy metric, calling it a revised fuzzy metric. In contrast to the traditional approach to the theory of fuzzy metric spaces which is based on the use of a t-norm, we proceed from a t-conorm in the definition of a revised fuzzy metric. Here, we restrict our study to the case of fuzzy metrics as they are defined by George-Veeramani, however, similar revision can be done also for some other approaches to the concept of a fuzzy metric.

0209 industrial biotechnologyLogicComputer scienceMathematics::General Mathematicst-norm02 engineering and technologyFuzzy logic<i>t</i>-norm020901 industrial engineering & automationGEORGE (programming language)0202 electrical engineering electronic engineering information engineeringt-conormMathematical PhysicsAlgebra and Number Theorybusiness.industrylcsh:MathematicsContrast (statistics)T-normlcsh:QA1-939Fuzzy metric spaceComputingMethodologies_PATTERNRECOGNITIONrestrictMetric (mathematics)<i>t</i>-conormfuzzy metric020201 artificial intelligence & image processingGeometry and TopologyArtificial intelligenceComputingMethodologies_GENERALbusinessAnalysisAxioms
researchProduct

A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms

2017

Evolutionary algorithms are widely used for solving multiobjective optimization problems but are often criticized because of a large number of function evaluations needed. Approximations, especially function approximations, also referred to as surrogates or metamodels are commonly used in the literature to reduce the computation time. This paper presents a survey of 45 different recent algorithms proposed in the literature between 2008 and 2016 to handle computationally expensive multiobjective optimization problems. Several algorithms are discussed based on what kind of an approximation such as problem, function or fitness approximation they use. Most emphasis is given to function approxim…

0209 industrial biotechnologyMathematical optimizationComputer scienceComputationEvolutionary algorithmComputational intelligence02 engineering and technologyMulti-objective optimizationTheoretical Computer Science020901 industrial engineering & automation0202 electrical engineering electronic engineering information engineeringmulticriteria optimizationsurrogateresponse surface approximationcomputational costmetamodelFitness approximationpareto optimalitypareto-tehokkuusFunction (mathematics)monitavoiteoptimointiFunction approximationkoneoppiminen020201 artificial intelligence & image processingGeometry and TopologySoftware
researchProduct

A note on best proximity point theory using proximal contractions

2018

In this paper, a reduction technique is used to show that some recent results on the existence of best proximity points for various classes of proximal contractions can be concluded from the corresponding results in fixed point theory.

021103 operations researchApplied MathematicsMathematical analysisBest proximity point0211 other engineering and technologiesproximal contractionfood and beveragesFixed-point theorem02 engineering and technologyFixed point01 natural sciencesPoint theory010101 applied mathematicsProximal contractionReduction (complexity)fixed pointModeling and SimulationGeometry and Topology0101 mathematicsMathematics
researchProduct

Best proximity point theorems for proximal cyclic contractions

2017

The purpose of this article is to compute a global minimizer of the function $$x\longrightarrow d(x, Tx)$$ , where T is a proximal cyclic contraction in the framework of a best proximally complete space, thereby ensuring the existence of an optimal approximate solution, called a best proximity point, to the equation $$Tx=x$$ when T is not necessarily a self-mapping.

021103 operations researchProximal cyclic contractionApplied Mathematics010102 general mathematicsMathematical analysisBest proximity point0211 other engineering and technologies02 engineering and technologyFunction (mathematics)Fixed pointTopology01 natural sciencesComplete metric spaceCyclic contractionSettore MAT/05 - Analisi MatematicaModeling and SimulationPoint (geometry)Global minimizationGeometry and Topology0101 mathematicsApproximate solutionMathematics
researchProduct